New Algorithm of Variable Hierarchical Structure Learning Automata for P-model Stationary Random Environment
نویسندگان
چکیده
منابع مشابه
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environment
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability I to the optimal path under the certain type of nonstationary environment. Several computer simulation results confirm the effectiveness of the proposed algorithm.
متن کاملRobust algorithm for random resistor networks using hierarchical domain structure
In this study we discuss methods for solving random resistor networks and similar problems. We discuss the node elimination method and we demonstrate its equivalence to the Gaussian elimination scheme, finding a good elimination order, which makes the method highly efficient. The transfer matrix method is shown to be a special case of the node elimination method with an ordering that is far fro...
متن کاملHierarchical Automata and P-systems
In the context of a compositional theory of automata [8] (CP automata) we define a notion of hierarchical automaton, and show how the P-systems of Gh. Păun [9] may be described in terms of these automata. A distributive law for CP automata is proved which relates two different views of hierarchical systems: the first view is that hierarchical systems consist of layers, with communication betwee...
متن کاملComputing tolerance interval for binomial random variable
Tolerance interval is a random interval that contains a proportion of the population with a determined confidence level and is applied in many application fields such as reliability and quality control. In this educational paper, we investigate different methods for computing tolerance interval for the binomial random variable using the package Tolerance in statistical software R.
متن کاملStationary Measures for Random Walks in aRandom Environment with Random
Let ? act on a countable set V with only nitely many orbits. Given a ?-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the environment and scenery from the viewpoint of the random walker. Such theorems have been very useful in investigations of percolation on quasi-transitive graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1998
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.34.239